Irrelevant matches in round-robin tournaments
نویسندگان
چکیده
منابع مشابه
Scheduling asynchronous round-robin tournaments
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known “circle design” performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule th...
متن کاملFirst-mover advantage in round-robin tournaments
We study round-robin tournaments with either three or four symmetric players whose values of winning are common knowledge. In the round-robin tournament with three players there are three stages, each of which includes one match between two players. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium and show that each player maximizes his ex...
متن کاملRound robin tournaments and three index assignments
Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...
متن کاملWin Sequences for Round-robin Tournaments
Each of n teams numbered 1, 2, · · · , n play each of the other n− 1 teams exactly one time for a total of ( n 2 ) = n(n − 1)/2 games. Each game produces a win for one team and a loss for the other team. Define (wi, li), i = 1, 2, · · · , n, to be the win-loss records for the teams. That is, team i, i = 1, 2, · · · , n, wins wi games and loses li games where wi + li = n− 1. Of course, n ∑
متن کاملBrother Avoiding Round Robin Doubles Tournaments II
We investigate brother avoiding round robin doubles tournaments and construct several infinite families. We show that there is a BARRDT(n) that is not a SAMDRR(n) for all n > 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2020
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-020-09483-6